Additive Latin Transversals
نویسنده
چکیده
We prove that for every odd prime p, every k ≤ p and every two subsets A = {a1, . . . , ak} and B = {b1, . . . , bk} of cardinality k each of Zp, there is a permutation π ∈ Sk such that the sums ai + bπ(i) (in Zp) are pairwise distinct. This partially settles a question of Snevily. The proof is algebraic, and implies several related results as well.
منابع مشابه
Transversals in Latin Squares: A Survey
A latin square of order n is an n×n array of n symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of n entries containing no pair of entries that share the same row, column or symbol. Transversals are closely related to the notions of complete mappings and orthomorphisms in (quasi)groups, and are fundamental to the concept of mutuall...
متن کاملTransversals in Latin Squares
A latin square of order n is an n×n array of n symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of n entries such that no two entries share the same row, column or symbol. Transversals are closely related to the notions of complete mappings and orthomorphisms in (quasi)groups, and are fundamental to the concept of mutually orthogon...
متن کاملOn the intersection of three or four transversals of the back circulant latin squares
Cavenagh and Wanless [Discrete Appl. Math. 158 no. 2 (2010), 136–146] determined the possible intersection of any two transversals of the back circulant latin square Bn, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We generalize this problem to the intersection of μ transversals of Bn such that the transversals intersect stably (that is, the int...
متن کاملGroups in Combinatorial Number Theory
In combinatorial number theory, there are many topics related to group structure. Even for abelian or cyclic groups, there are some very challenging unsolved conjectures. In this talk we give a survey of problems, results and methods in several fields of combinatorial number theory. The topics include sumsets in additive combinatorics, Snevily’s conjecture and Latin transversals, covers of the ...
متن کاملThe number of transversals in a Latin square
A Latin square of order n is an n × n array of n symbols, in which each symbol occurs exactly once in each row and column. A transversal is a set of n entries, one selected from each row and each column of a Latin square of order n such that no two entries contain the same symbol. Define T (n) to be the maximum number of transversals over all Latin squares of order n. We show that bn ≤ T (n) ≤ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002